The Birch and Swinnerton-Dyer Conjecture, a Computational Approach
نویسنده
چکیده
منابع مشابه
Computational verification of the Birch and Swinnerton-Dyer conjecture for individual elliptic curves
We describe theorems and computational methods for verifying the Birch and Swinnerton-Dyer conjectural formula for specific elliptic curves over Q of analytic ranks 0 and 1. We apply our techniques to show that if E is a non-CM elliptic curve over Q of conductor ≤ 1000 and rank 0 or 1, then the Birch and Swinnerton-Dyer conjectural formula for the leading coefficient of the L-series is true for...
متن کاملThe Birch-swinnerton-dyer Conjecture
We give a brief description of the Birch-Swinnerton-Dyer conjecture which is one of the seven Clay problems.
متن کاملOn the elliptic curves of the form $ y^2=x^3-3px $
By the Mordell-Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. There is no known algorithm for finding the rank of this group. This paper computes the rank of the family $ E_p:y^2=x^3-3px $ of elliptic curves, where p is a prime.
متن کاملON RUBIN’S VARIANT OF THE p-ADIC BIRCH AND SWINNERTON-DYER CONJECTURE
We study Rubin’s variant of the p-adic Birch and Swinnerton-Dyer conjecture for CM elliptic curves concerning certain special values of the Katz two-variable p-adic L-function that lie outside the range of p-adic interpolation.
متن کاملOn the rank of elliptic curves
The paper describes an approach that may lead to a proof that the Birch and Swinnerton-Dyer conjecture fails.
متن کامل